Search Results

Documents authored by Chen, Min

Found 3 Possible Name Variants:

Chen, Min

Document
DOI: 10.4230/DagRep.4.6.1
Scientific Visualization (Dagstuhl Seminar 14231)

Authors: Min Chen, Charles D. Hansen, Penny Rheingans, and Gerik Scheuermann

Published in: Dagstuhl Reports, Volume 4, Issue 6 (2015)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14231 "Scientific Visualization". It includes a discussion of the motivation and overall organization, an abstract from each of the participants, and a report from each of the working groups.
Cite as

Min Chen, Charles D. Hansen, Penny Rheingans, and Gerik Scheuermann. Scientific Visualization (Dagstuhl Seminar 14231). In Dagstuhl Reports, Volume 4, Issue 6, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@Article{chen_et_al:DagRep.4.6.1,
  author =	{Chen, Min and Hansen, Charles D. and Rheingans, Penny and Scheuermann, Gerik},
  title =	{{Scientific Visualization (Dagstuhl Seminar 14231)}},
  pages =	{1--28},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{6},
  editor =	{Chen, Min and Hansen, Charles D. and Rheingans, Penny and Scheuermann, Gerik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.4.6.1},
  URN =		{urn:nbn:de:0030-drops-46821},
  doi =		{10.4230/DagRep.4.6.1},
  annote =	{Keywords: data visualization, multi-fields, uncertainty, environmental visualization}
}
Document
DOI: 10.4230/DagRep.1.6.1
Scientific Visualization (Dagstuhl Seminar 11231)

Authors: Min Chen, Hans Hagen, Charles D. Hansen, and Arie Kaufman

Published in: Dagstuhl Reports, Volume 1, Issue 6 (2011)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 11231 ``Scientific Visualization''.
Cite as

Min Chen, Hans Hagen, Charles D. Hansen, and Arie Kaufman. Scientific Visualization (Dagstuhl Seminar 11231). In Dagstuhl Reports, Volume 1, Issue 6, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@Article{chen_et_al:DagRep.1.6.1,
  author =	{Chen, Min and Hagen, Hans and Hansen, Charles D. and Kaufman, Arie},
  title =	{{Scientific Visualization (Dagstuhl Seminar 11231)}},
  pages =	{1--23},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{6},
  editor =	{Chen, Min and Hagen, Hans and Hansen, Charles D. and Kaufman, Arie},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.1.6.1},
  URN =		{urn:nbn:de:0030-drops-32574},
  doi =		{10.4230/DagRep.1.6.1},
  annote =	{Keywords: Scientific Visualization, Biomedical Visualization, Integrated Multifield Visualization, Uncertainty Visualization, Scalable Visualization}
}
Document
DOI: 10.4230/DFU.SciViz.2010.259
Local and Global Illumination in the Volume Rendering Integral

Authors: Nelson Max and Min Chen

Published in: Dagstuhl Follow-Ups, Volume 1, Scientific Visualization: Advanced Concepts (2010)

Abstract
This article is intended as an update of the major survey by Max [Max, "Optical models for direct volume rendering.", IEEE Trans. on Visualization and Computer Graphics, 1(2):99–108, 1995] on optical models for direct volume rendering. It provides a brief overview of the subject scope covered by [Max, "Optical models for direct volume rendering.", IEEE Trans. on Visualization and Computer Graphics, 1(2):99–108, 1995], and brings recent developments, such as new shadow algorithms and refraction rendering, into the perspective. In particular, we examine three fundamentals aspects of direct volume rendering, namely the volume rendering integral, local illumination models and global illumination models, in a wavelength-independent manner. We review the developments on spectral volume rendering, in which visible light are considered as a form of electromagnetic radiation, optical models are implemented in conjunction with representations of spectral power distribution. This survey can provide a basis for, and encourage, new efforts for developing and using complex illumination models to achieve better realism and perception through optical correctness.
Cite as

Nelson Max and Min Chen. Local and Global Illumination in the Volume Rendering Integral. In Scientific Visualization: Advanced Concepts. Dagstuhl Follow-Ups, Volume 1, pp. 259-274, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InCollection{max_et_al:DFU.SciViz.2010.259,
  author =	{Max, Nelson and Chen, Min},
  title =	{{Local and Global Illumination in the Volume Rendering Integral}},
  booktitle =	{Scientific Visualization: Advanced Concepts},
  pages =	{259--274},
  series =	{Dagstuhl Follow-Ups},
  ISBN =	{978-3-939897-19-4},
  ISSN =	{1868-8977},
  year =	{2010},
  volume =	{1},
  editor =	{Hagen, Hans},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.SciViz.2010.259},
  URN =		{urn:nbn:de:0030-drops-27090},
  doi =		{10.4230/DFU.SciViz.2010.259},
  annote =	{Keywords: Volume Rendering, Illumination Model}
}

Chen, Haiming

Document
DOI: 10.4230/LIPIcs.MFCS.2017.22
The Complexity of SORE-definability Problems

Authors: Ping Lu, Zhilin Wu, and Haiming Chen

Published in: LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)

Abstract
Single occurrence regular expressions (SORE) are a special kind of deterministic regular expressions, which are extensively used in the schema languages DTD and XSD for XML documents. In this paper, with motivations from the simplification of XML schemas, we consider the SORE-definability problem: Given a regular expression, decide whether it has an equivalent SORE. We investigate extensively the complexity of the SORE-definability problem: We consider both (standard) regular expressions and regular expressions with counting, and distinguish between the alphabets of size at least two and unary alphabets. In all cases, we obtain tight complexity bounds. In addition, we consider another variant of this problem, the bounded SORE-definability problem, which is to decide, given a regular expression E and a number M (encoded in unary or binary), whether there is an SORE, which is equivalent to E on the set of words of length at most M. We show that in several cases, there is an exponential decrease in the complexity when switching from the SORE-definability problem to its bounded variant.
Cite as

Ping Lu, Zhilin Wu, and Haiming Chen. The Complexity of SORE-definability Problems. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, pp. 22:1-22:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{lu_et_al:LIPIcs.MFCS.2017.22,
  author =	{Lu, Ping and Wu, Zhilin and Chen, Haiming},
  title =	{{The Complexity of SORE-definability Problems}},
  booktitle =	{42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
  pages =	{22:1--22:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-046-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{83},
  editor =	{Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.22},
  URN =		{urn:nbn:de:0030-drops-80822},
  doi =		{10.4230/LIPIcs.MFCS.2017.22},
  annote =	{Keywords: Single occurrence regular expressions, Definability, Complexity}
}

Chen, Haimin

Document
DOI: 10.4230/LIPIcs.OPODIS.2020.22
Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks

Authors: Haimin Chen and Chaodong Zheng

Published in: LIPIcs, Volume 184, 24th International Conference on Principles of Distributed Systems (OPODIS 2020)

Abstract
Broadcasting in wireless networks is vulnerable to adversarial jamming. To thwart such behavior, resource competitive analysis is proposed. In this framework, sending, listening, or jamming on one channel for one time slot costs one unit of energy. The adversary can employ arbitrary strategy to disrupt communication, but has a limited energy budget T. The honest nodes, on the other hand, aim to accomplish broadcast while spending only o(T). Previous work has shown, in a C-channels network containing n nodes, for large T values, each node can receive the message in Õ(T/C) time, while spending only Õ(√{T/n}) energy. However, these multi-channel algorithms only work for certain values of n and C, and can only tolerate an oblivious adversary. In this work, we provide new upper and lower bounds for broadcasting in multi-channel radio networks, from the perspective of resource competitiveness. Our algorithms work for arbitrary n,C values, require minimal prior knowledge, and can tolerate a powerful adaptive adversary. More specifically, in our algorithms, for large T values, each node’s runtime is O(T/C), and each node’s energy cost is Õ(√{T/n}). We also complement algorithmic results with lower bounds, proving both the time complexity and the energy complexity of our algorithms are optimal or near-optimal (within a poly-log factor). Our technical contributions lie in using "epidemic broadcast" to achieve time efficiency and resource competitiveness, and employing coupling techniques in the analysis to handle the adaptivity of the adversary. At the lower bound side, we first derive a new energy complexity lower bound for 1-to-1 communication in the multi-channel setting, and then apply simulation and reduction arguments to obtain the desired result.
Cite as

Haimin Chen and Chaodong Zheng. Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks. In 24th International Conference on Principles of Distributed Systems (OPODIS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 184, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{chen_et_al:LIPIcs.OPODIS.2020.22,
  author =	{Chen, Haimin and Zheng, Chaodong},
  title =	{{Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks}},
  booktitle =	{24th International Conference on Principles of Distributed Systems (OPODIS 2020)},
  pages =	{22:1--22:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-176-4},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{184},
  editor =	{Bramas, Quentin and Oshman, Rotem and Romano, Paolo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.22},
  URN =		{urn:nbn:de:0030-drops-135076},
  doi =		{10.4230/LIPIcs.OPODIS.2020.22},
  annote =	{Keywords: Broadcast, radio networks, resource competitive algorithms}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact